Modular Irregular Labeling On Complete Graphs
نویسندگان
چکیده
Let G be a simple graph of n order. An edge labeling such that the weights all vertex are different and elements set modulo n, called modular irregular labeling. The irregularity strength is minimum positive integer k have If none, then we infinity. In this article, determine complete graphs.
منابع مشابه
Labeling Irregular Graphs with Belief Propagation
This paper proposes a statistical approach to labeling images using a more natural graphical structure than the pixel grid (or some uniform derivation of it such as square patches of pixels). Typically, low-level vision estimations based on graphical models work on the regular pixel lattice (with a known clique structure and neighborhood). We move away from this regular lattice to more meaningf...
متن کاملNeighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملEdge irregular total labeling of certain family of graphs
An edge irregular total k-labeling φ : V (G)∪E(G) → {1, 2, . . . , k} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights φ(x) + φ(xy) + φ(y) and φ(x′) + φ(x′y′) + φ(y′) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. We have ...
متن کاملSimilar Elements and Metric Labeling on Complete Graphs
We consider a problem that involves finding similar elements in a collection of sets. The problem is motivated by applications in machine learning and pattern recognition (see, e.g. [2]). Intuitively we would like to discover something in common among a collection of sets, even when the sets have empty intersection. A solution involves selecting an element from each set such that the selected e...
متن کاملOn maximally irregular graphs
Let G be a connected graph with maximum degree ∆(G). The irregularity index t(G) of G is defined as the number of distinct terms in the degree sequence of G. We say that G is maximally irregular if t(G) = ∆(G). The purpose of this note, apart from pointing out that every highly irregular graph is maximally irregular, is to establish upper bounds on the size of maximally irregular graphs and max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Daya Matematis : Jurnal Inovasi Pendidikan Matematika
سال: 2022
ISSN: ['2354-7146', '2541-4232']
DOI: https://doi.org/10.26858/jdm.v10i3.37426